Constrained Non-Renewable Resource Allocation in Metagraphs with Discrete Random Times
نویسندگان
چکیده مقاله:
In this paper, it is supposed that a project can be shown as a metagraph. The duration of activities are discrete random variables with known probability function, also one kind of consumable and constrained resource is required to execute each activity of the project.The objective of this paper is to maximize the probability of completion of stochastic metagraph before the due date of the project.
منابع مشابه
Constrained Renewable Resource Allocation in Fuzzy Metagraphs via Min-Slack
This paper discusses that the fuzzy metagraphs can be used as a tool for scheduling and control of fuzzy projects. Often, available resources for executing projects may be limited. It is assumed the resources required to accomplish each activity of project (metagraph edges) is renewable. One of the common methods for scheduling projects is using the min-slack. So, first, the forward and bac...
متن کاملSplittable stochastic project scheduling with constrained renewable resource
This paper discusses the problem of allocation of constrained renewable resource to splittable activities of a single project. If the activities of stochastic projects can be split, these projects may be completed in shorter time when the available resource is constrained. It is assumed that the resource amount required to accom-plish each activity is a discrete quantity and deterministic. The ...
متن کاملMulti-mode renewable resource-constrained allocation in PERT networks
This paper presents a hybrid metaheuristic algorithm (HMA) for Multi-Mode Resource-Constrained Project Scheduling Problem (MRCPSP) in PERT networks. A PERT-type project, where activities require resources of various types with random duration, is considered. Each activity can be accomplished in one of several execution modes and each execution mode represents an alternative combination of resou...
متن کامل2001: Constrained Optimization over Discrete Sets via Spsa with Application to Non-separable Resource Allocation
This paper presents a version of the Simultaneous Perturbation Stochastic Approximation (SPSA) algorithm for optimizing non-separable functions over discrete sets under given constraints. The primary motivation for discrete SPSA is to solve a class of resource allocation problems wherein the goal is to distribute a finite number of discrete resources to finitely many users in such a way as to o...
متن کاملsplittable stochastic project scheduling with constrained renewable resource
this paper discusses the problem of allocation of constrained renewable resource to splittable activities of a single project. if the activities of stochastic projects can be split, these projects may be completed in shorter time when the available resource is constrained. it is assumed that the resource amount required to accom-plish each activity is a discrete quantity and deterministic. the ...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 11 شماره 4
صفحات 293- 305
تاریخ انتشار 2019-12-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023